Generalized Benson–Carlson Duality

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Serre duality

We introduce the generalized Serre functor S on a skeletally-small Hom-finite Krull-Schmidt triangulated category C. We prove that its domain Cr and range Cl are thick triangulated subcategories. Moreover, the subcategory Cr (resp. Cl) is the smallest additive subcategory containing all the objects in C which appears as the third term (resp. the first term) of some Aulsander-Reiten triangle in ...

متن کامل

On Brylawski's Generalized Duality

We introduce a notion of duality—due to Brylawski—that generalizes matroid duality to arbitrary rank functions. This allows us to define a generalization of the matroid Tutte polynomial. This polynomial satisfies a deletion-contraction recursion, where deletion and contraction are defined in this more general setting. We explore this notion of duality for greedoids, antimatroids and demi-matroi...

متن کامل

Generalized Benson-carlson Duality

1.1. Background. This paper deals with the landmark results of Benson and Carlson's Projective resolutions and Poincar e duality complexes [6]. Our goal is to provide some necessary background for that work, and to prove some of the results of [6] in a more general setting. In particular, we analyze what happens when we replace Benson and Carlson's complex C (in the notation of [6]) with an arb...

متن کامل

Generalized roof duality

The roof dual bound for quadratic unconstrained binary optimization is the basis for several methods for efficiently computing the solution to many hard combinatorial problems. It works by constructing the tightest possible lower-bounding submodular function, and instead of minimizing the original objective function, the relaxation is minimized. However, for higher-order problems the technique ...

متن کامل

Generalized Mixability via Entropic Duality

Mixability is a property of a loss which characterizes when fast convergence is possible in the game of prediction with expert advice. We show that a key property of mixability generalizes, and the exp and log operations present in the usual theory are not as special as one might have thought. In doing this we introduce a more general notion of Φ-mixability where Φ is a general entropy (i.e., a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1996

ISSN: 0021-8693

DOI: 10.1006/jabr.1996.0036